Cone Invariance and Rendezvous of Multiple Agents
نویسندگان
چکیده
In this paper we present a dynamical systems framework for analyzing multi-agent rendezvous problems and characterize the dynamical behavior of the collective system. Recently, the problem of rendezvous has been addressed considerably in the graph theoretic framework, which is strongly based on the communication aspects of the problem. The proposed approach is based on set invariance theory and focusses on how to generate feedback between the vehicles, a key part of the rendezvous problem. The rendezvous problem is defined on the positions of the agents and the dynamics is modeled as linear first order systems. The proposed framework however is not fundamentally limited to linear first order dynamics and can be extended to analyze rendezvous of higher order agents. In the proposed framework, the problem of rendezvous is cast as a stabilization problem, with a set of constraints on the trajectories of the agents defined on the phase plane. We pose the n-agent rendezvous problem as an ellipsoidal cone invariance problem in the n dimensional phase space. Theoretical results based on set invariance theory and monotone dynamical systems are developed. The necessary and sufficient conditions for rendezvous of linear systems are presented in form of linear matrix inequalities. These conditions are also interpreted in the Lyapunov framework using multiple Lyapunov functions. Numerical examples that demonstrate application are also presented. Index Terms Multi-agent rendezvous, cooperative dynamical systems, monotone systems, cone invariance, non-negative matrices.
منابع مشابه
Effect of Relocation and Rotation on Radial Efficiency Scores for a Partially Negative Data Problem
Negative data handling has gained a remarkable importance in the literature of Data Envelopment Analysis (DEA) to address many real life problems. Various erstwhile applications, in this arena, referred relocation of the origin to a superior (RDM) or to an inferior (Translated Input Oriented BCC) neighboring point. In this paper, the conditions for Rotation Invariance of various Data Envelop...
متن کاملMultiple Agents RendezVous in a Ring in Spite of a Black Hole
The Rendezvous of anonymous mobile agents in a anonymous network is an intensively studied problem; it calls for k anonymous, mobile agents to gather in the same site. We study this problem when in the network there is a black hole: a stationary process located at a node that destroys any incoming agent without leaving any trace. The presence of the black hole makes it clearly impossible for al...
متن کاملGossip-Based Solutions for Discrete Rendezvous in Populations of Communicating Agents
The objective of the rendezvous problem is to construct a method that enables a population of agents to agree on a spatial (and possibly temporal) meeting location. We introduce the buffered gossip algorithm as a general solution to the rendezvous problem in a discrete domain with direct communication between decentralized agents. We compare the performance of the buffered gossip algorithm agai...
متن کاملRendezvous of Mobile Agents without Agreement on Local Orientation
The exploration of a connected graph by multiple mobile agents has been previously studied under different conditions. A fundamental coordination problem in this context is the gathering of all agents at a single node, called the Rendezvous problem. To allow deterministic exploration, it is usually assumed that the edges incident to a node are locally ordered according to a fixed function calle...
متن کاملOn rendezvous control with randomly switching communication graphs
In this paper we analyze randomized coordination control strategies for the rendezvous problem of multiple agents with unknown initial positions. The performance of these control strategies is measured in terms of three metrics: average relative agents’ distance, total input energy consumption, and number of packets per unit time that each agent can receive from the other agents. By considering...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006